Search results for "Dyck language"

showing 1 items of 1 documents

Quantum Algorithm for Dyck Language with Multiple Types of Brackets

2021

We consider the recognition problem of the Dyck Language generalized for multiple types of brackets. We provide an algorithm with quantum query complexity \(O(\sqrt{n}(\log n)^{0.5k})\), where n is the length of input and k is the maximal nesting depth of brackets. Additionally, we show the lower bound for this problem which is \(\varOmega (\sqrt{n}c^{k})\) for some constant c.

CombinatoricsQuantum queryRegular languageNesting (computing)Dyck languageQuantum algorithmConstant (mathematics)Binary logarithmUpper and lower boundsMathematics
researchProduct